Cut-Set Sums and Tree Processes

Products and Sums of Tree-Structured Gaussian Processes

Quantification of Cut Sequence Set for Fault Tree Analysis

A new evaluation method is presented that employs cut sequence set (CSS) to analyze fault trees. A cut sequence is a set of basic events that fail in a specific order that can induce top event. CSS is the aggregate of all the cut sequences in a fault tree. The paper continues its former researches on CSS and uses CSS, composed of sequential failure expressions (SFE), to represent the occurrence...

Cut-off for large sums of graphs

If L is the combinatorial Laplacian of a graph, exp(−L t) converges to a matrix with identical coefficients. The speed of convergence is measured by the maximal entropy distance. When the graph is the sum of a large number of components, a cut-off phenomenon may occur: before some instant the distance to equilibrium tends to infinity; after that instant it tends to 0. A sufficient condition for...

Approximation Algorithms : Set Cover and Max Cut 1 Unweighted Set

Biometrics of Cut Tree Faces

An issue of some interest to those in the lumber and timber industry is the rapid matching of a cut log face with its mate. For example, the U.S. Forest Service experiences a considerable loss of its valuable tree properties through poaching every year. They desire a tool that can rapidly scan a stack of cut timber faces, taken in a suspect lumber mill yard, and identify matches to a scanned ph...